Visit every square exactly once with a knight's moves.
Total solutions: 26,534,728,821,064
The knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square exactly once.
Rules: Move in an L-shape (2 by 1). No square may be visited more than once.